A Pseudorandom Generator from any One-way Function
نویسندگان
چکیده
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a pseudorandom generator from any one-way function. Since it is easy to construct a one-way function from a pseudorandom generator, this result shows that there is a pseudorandom generator if and only if there is a one-way function.
منابع مشابه
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
In their seminal paper [HILL99], H̊astad, Impagliazzo, Levin and Luby show that a pseudorandom generator can be constructed from any one-way function. This plausibility result is one of the most fundamental theorems in cryptography and helps shape our understanding of hardness and randomness in the field. Unfortunately, the reduction of [HILL99] is not nearly as efficient nor as security preserv...
متن کاملPseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness
In a seminal paper, H̊astad, Impagliazzo, Levin, and Luby showed that pseudorandom generators exist if and only if one-way functions exist. The construction they propose to obtain a pseudorandom generator from an n-bit one-way function uses O(n) random bits in the input (which is the most important complexity measure of such a construction). In this work we study how much this can be reduced if ...
متن کاملA Remark on One-Wayness versus Pseudorandomness
Every pseudorandom generator is in particular a one-way function. If we only consider part of the output of the pseudorandom generator is this still one-way? Here is a general setting formalizing this question. Suppose G : {0, 1} → {0, 1} is a pseudorandom generator with stretch `(n). Let MR ∈ {0, 1}m(n)×`(n) be a linear operator computable in polynomial time given randomness R. Consider the fu...
متن کاملPseudorandom Generators from Regular One-Way Functions: New Constructions with Improved Parameters
We revisit the problem of basing pseudorandom generators on regular one-way functions, and present the following constructions: – For any known-regular one-way function (on n-bit inputs) that is known to be ε-hard to invert, we give a neat (and tighter) proof for the folklore construction of pseudorandom generator of seed length Θ(n) by making a single call to the underlying one-way function. –...
متن کاملMonotone Circuits: One-Way Functions versus Pseudorandom Generators
We study the computability of one-way functions and pseudorandom generators by monotone circuits, showing a substantial gap between the two: On one hand, there exist one-way functions that are computable by (uniform) polynomial-size monotone functions, provided (of course) that one-way functions exist at all. On the other hand, no monotone function can be a pseudorandom generator.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 28 شماره
صفحات -
تاریخ انتشار 1999